Arithmetic functions in an algebraic setting
نویسندگان
چکیده
منابع مشابه
Arithmetic upon an Algebraic Surface
The title of my lecture is, I am afraid, probably misleading and certainly too ambitious. For, on the one hand, the connection between arithmetic and geometry suggested by it is not the modern development in divisors theory, but an application of algebraic geometry for arithmetical purposes. On the other hand, I shall confine the subject of this lecture to cubic surfaces in ordinary space, cons...
متن کاملTowards an Algebraic Description of Set Arithmetic
To describe the state of the world, we need to describe the values of all physical quantities. In practice, due to inevitable measurement inaccuracy, we do not know the exact values of these quantities, we only know the sets of possible values for these quantities. On the class of such uncertainty-related sets, we can naturally define arithmetic operations that transform, e.g., uncertainty in a...
متن کاملDecision Theory in an Algebraic Setting
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given. We adopt an algebraic point of view by substituting the algebra of events with a finite distributive lattice and the probability measure with a lattice valu...
متن کاملλ-calculus in an algebraic setting
We define an extension of λ-calculus with linear combinations of terms, with coefficients taken in a fixed rig R. We extend β-reduction on these terms as follows: at + u reduces to at + u as soon as term t reduces to t and a is a non-zero scalar. We prove that reduction is confluent. Under the assumption that R is a positive rig (i.e. a sum of scalars is zero iff all of them are zero), we show ...
متن کاملArithmetic complexity in algebraic extensions
Given a polynomial f with coefficients from a field F, is it easier to compute f over an extension R of F than over F? We address this question, and show the following. For every polynomial f , there is a noncommutative extension R so that over R, f has polynomial size formulas. On the other hand, if F is algebraically closed, no commutative extension R can decrease formula or circuit complexit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tsukuba Journal of Mathematics
سال: 1991
ISSN: 0387-4982
DOI: 10.21099/tkbjm/1496161585